constrained optimization problem造句
例句與造句
- immune chaotic algorithm for constrained optimization problems
約束優(yōu)化問題的免疫混沌算法 - solution to constrained optimization problems in fuzzy expert system
模糊專家系統(tǒng)中約束最優(yōu)化問題求解 - a trust-region algorithm for nonlinear constrained optimization problem
解非線性約束優(yōu)化問題的依賴域算法 - artificial fish-swarm algorithm for solving constrained optimization problems
求解約束優(yōu)化問題的人工魚群算法 - convergence analysis of broyden methods for lc1 constrained optimization problems
1類約束優(yōu)化問題的擬牛頓算法 - It's difficult to find constrained optimization problem in a sentence. 用constrained optimization problem造句挺難的
- an improved algorithm for solving ineuqality constrained optimization problems
求解不等式約束優(yōu)化問題的一個(gè)改進(jìn)算法 - in this paper, we are concerned with the sequence quadratic programming ( sqp ) methods for solving constrained optimization problems
本文研究求解約束最優(yōu)化問題的序列二次規(guī)劃算法(sqp算法)。 - the key to investigating optimization problems, especially constrained optimization problems, is to design efficient algorithm for solving it
最優(yōu)化問題特別是約束優(yōu)化問題研究的一個(gè)核心是設(shè)計(jì)有效的算法。 - the filter technique was first studied by fletcher and leyffer in the sequential quadratic programming ( sqp ) method for solving constrained optimization problems
本文研究了求解無約束最優(yōu)化問題的newton-過濾器(newton-filter)算法。過濾器算法由fletcher-leyffer提出。 - we present and analyze a modified penalty functions ( mpf ) method for solving constrained optimization problems with inequality constraints . this method combines the modified penalty and the lagrangian methods
本文提出并分析一種解決不等式約束最優(yōu)化問題的修改的罰函數(shù)法，這一方法綜合利用修改的罰函數(shù)和拉格朗日法。 - first, we reformulate the kkt systems of the constrained optimization problem and the symmetric variational inequality prpoblem into equivalent nonsrnooth equations by using the so called ncp functions
本文研究求解約束最優(yōu)化問題和對(duì)稱變分不等式kkt系統(tǒng)的bfgs算法。首先利用ncp函數(shù)將問題的kkt系統(tǒng)轉(zhuǎn)化為等價(jià)的非光滑方程組。 - taking biosphere and adaptive mathematic models into account, a new open genetic algorithm based on niche was proposed, which overcome the defects of current genetic algorithm in solving constrained optimization problems
針對(duì)現(xiàn)有遺傳算法處理帶約束優(yōu)化問題時(shí)存在的缺點(diǎn)，基于小生境技術(shù)提出一種新的開放式遺傳算法，證明它一定能收斂到全局最優(yōu)解。 - in this thesis, we extend the entropy regularization method in two ways : from the min-max problem to general inequality constrained optimization problems and from the entropy function to more general functions
本文從兩個(gè)方面發(fā)展了這種熵正則化方法，即將其從極大極小問題推廣到一般不等式約束優(yōu)化問題上和用一般函數(shù)代替熵函數(shù)作正則項(xiàng)，建立新的正則化方法。 - we apply these dual algorithms to solve a large number of nonlinear optimization problems with relative small scale, including inequality constrained optimization problems, unconstrained minimax problems and general constrained optimization problems
用這些算法計(jì)算大量的規(guī)模不是很大的不等式約束優(yōu)化問題，無約束極大極小問題，一般約束優(yōu)化問題，數(shù)值結(jié)果表明它們是有效的 - we apply these dual algorithms to solve a large number of nonlinear optimization problems with relative small scale, including inequality constrained optimization problems, unconstrained minimax problems and general constrained optimization problems
用這些算法計(jì)算大量的規(guī)模不是很大的不等式約束優(yōu)化問題，無約束極大極小問題，一般約束優(yōu)化問題，數(shù)值結(jié)果表明它們是有效的
更多例句： 下一頁